Using Evolutionary Algorithms to study Bargaining Problems

نویسندگان

  • Nanlin Jin
  • Edward Tsang
چکیده

The objective of this research is to tackle bargaining problems with Evolutionary Algorithms (EA). EA have been proved effective for a wide variety of problems. In this paper, we apply EA to solve Rubinstein’s Basic Alternating-Offer Bargaining Problem whose game-theoretic solution is known. Experimental outcomes suggest that EA are able to generate convincing approximations of the theoretic solutions. The establishment of EA being a practical method for solving this bargaining problem helps to support the plan of studying bargaining situations whose theoretic solutions are unknown. EA’s advantages in flexibility make it relatively easy to be applied to variant of Rubinstein Bargaining Problems and complex bargaining situations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-based Co-evolutionary Genetic Programming for Bargaining Problems

This thesis applies evolutionary algorithms to tackle bargaining games. Evolutionary algorithms can discover efficient and stationary strategies for various bargaining games. Game-theoretic method requires a substantial amount of mathematical reasoning. Thus this method restricts to simple problems. Moreover, game-theoretic solutions rest on the crucial assumption that every player is perfectly...

متن کامل

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

متن کامل

VMLP neural network design using optimization algorithms to predict spider suspend (Case Study: Watershed Dam Kardeh)

One of the most important processes of erosion and sediment transport in streams is the river most complex engineering  issues.this process special effects on water quality indices, action suburbs floor and destroyed much damage to the river and also into the development plans  Lack of continuity sediment sampling and measurement of many existing stations. due to the low number of hydrometric s...

متن کامل

Prediction of Surface Roughness by Hybrid Artificial Neural Network and Evolutionary Algorithms in End Milling

Machining processes such as end milling are the main steps of production which have major effect on the quality and cost of products. Surface roughness is one of the considerable factors that production managers tend to implement in their decisions. In this study, an artificial neural network is proposed to minimize the surface roughness by tuning the conditions of machining process such as cut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004